Merrifield-Simmons and Hosoya index of thorn-regular graphs
نویسندگان
چکیده
منابع مشابه
Graphs with maximal Hosoya index and minimal Merrifield-Simmons index
For a graph G, the Hosoya index and the Merrifield-Simmons index are defined as the total number of its matchings and the total number of its independent sets, respectively. In this paper, we characterize the structure of those graphs that minimize the Merrifield-Simmons index and those that maximize the Hosoya index in two classes of simple connected graphs with n vertices: graphs with fixed m...
متن کاملExtremal Hosoya index and Merrifield-Simmons index of hexagonal spiders
For any graph G, let m(G) and i(G) be the numbers of matchings (i.e., the Hosoya index) and the number of independent sets (i.e., the Merrifield–Simmons index) of G, respectively. In this paper, we show that the linear hexagonal spider and zig-zag hexagonal spider attain the extremal values of Hosoya index and Merrifield–Simmons index, respectively. c © 2008 Elsevier B.V. All rights reserved.
متن کاملOn the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth
For a graph G, the Merrifield-Simmons index i(G) and the Hosoya index z(G) are defined as the total number of independent sets and the total number of matchings of the graph G, respectively. In this paper, we characterize the graphs with the maximal Merrifield-Simmons index and the minimal Hosoya index, respectively, among the bicyclic graphs on n vertices with a given girth g.
متن کاملThe Merrifield-Simmons Index and Hosoya Index of C(n, k, λ) Graphs
The Merrifield-Simmons index i G of a graph G is defined as the number of subsets of the vertex set, in which any two vertices are nonadjacent, that is, the number of independent vertex sets of G The Hosoya index z G of a graph G is defined as the total number of independent edge subsets, that is, the total number of its matchings. By C n, k, λ we denote the set of graphs with n vertices, k cyc...
متن کاملSome extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index
The Hosoya index of a graph is defined as the total number of the matchings, including the empty edge set, of the graph. The Merrifield-Simmons index of a graph is defined as the total number of the independent vertex sets, including the empty vertex set, of the graph. Let U(n,∆) be the set of connected unicyclic graphs of order n with maximum degree ∆. We consider the Hosoya indices and the Me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Publications of the State University of Novi Pazar Series A: Applied Mathematics, Informatics and mechanics
سال: 2016
ISSN: 2217-5539
DOI: 10.5937/spsunp1602113b